Quantum One-Sided Exact Error Algorithms
نویسنده
چکیده
We define a complexity class for randomized algorithms with one-sided error that is exactly equal to a constant (unlike the usual definitions, in which the error is only bounded above or below by a constant). We show that the corresponding quantum classes (one each for a different error probability) are in fact all equivalent to each other and to EQP, the quantum analogue of P. The technique used is a form of quantum amplitude amplification.
منابع مشابه
Two-sided Quantum Amplitude Amplification and Exact-Error Algorithms
Amplitude amplification is a central tool used in Grover’s quantum search algorithm and has been used in various forms in numerous quantum algorithms since then. It has been shown to completely eliminate one-sided error of quantum search algorithms where input is accessed in the form of black-box queries. We generalize amplitude amplification for two-sided error quantum algorithm for decision p...
متن کاملApplications of Quantum Amplitude Amplification
Amplitude amplification is a central tool used in Grover’s quantum search algorithm and has been used in various forms in numerous quantum algorithms since then. It has been shown to completely eliminate one-sided error of quantum search algorithms where input is accessed in the form of black-box queries. We generalize amplitude amplification for decision problems in the familiar form where inp...
متن کاملOn Randomized and Quantum Query Complexities
We study randomized and quantum query (a.k.a. decision tree) complexity for all total Boolean functions, with emphasis to derandomization and dequantization (removing quantumness from algorithms). Firstly, we show that D(f) = O(Q1(f) ) for any total function f , where D(f) is the minimal number of queries made by a deterministic query algorithm and Q1(f) is the number of queries made by any qua...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملOne Sided Error Predicates in Geometric Computing
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicates, such as orientationor incircle-tests, this allows efficient floating point implementations of the predicates with rare occurrences of the one sided error. We discuss the use of such conservative implementations for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 21 شماره
صفحات -
تاریخ انتشار 2014